Entropy-Constrained Successively Refinable Scaler Quantization
نویسندگان
چکیده
We study the design of entropy{constrained successively reenable scalar quantizers. We propose two algorithms to minimize the average distortion and design such a quantizer. We consider two sets of constraints on the entropy: (i) constraint on the average rate and (ii) constraint on aggregate rates. Both algorithms can be easily extended to design vector quantizers.
منابع مشابه
Analysis of 1-D Nested Lattice Quantization and Slepian-Wolf Coding for Wyner-Ziv Coding of i.i.d. Sources
Entropy coded scaler quantization (ECSQ) performs 1.53 dB from optimal lossy compression at high data rates. In this paper, we generalize this result for distributed source coding with side information. 1-D nested scaler quantization with Slepian-Wolf coding is compared to Wyner-Ziv coding of i.i.d. Gaussian sources at high data rates. We show that nested scaler quantization with Slepian-Wolf c...
متن کاملDesign of successively refinable trellis-coded quantizers
We propose successively refinable trellis-coded quantizers for progressive transmission. (Progressive transmission is an essential component of image and multimedia browsing systems.) A new trellis structure which is scalable is used in the design of our trellis-coded quantizers. A hierarchical set partitioning is developed to preserve successive refinability. Two algorithms for designing trell...
متن کاملError Bounds for High-resolution Quantization with Rényi-α-entropy Constraints
We consider the problem of optimal quantization with norm exponent r > 0 for Borel probability measures on R under constrained Rényi-αentropy of the quantizers. If the bound on the entropy becomes large, then sharp asymptotics for the optimal quantization error are well-known in the special cases α = 0 (memory-constrained quantization) and α = 1 (Shannon-entropy-constrained quantization). In th...
متن کاملConditional Entropy Constrained Tree Structured Vector Quantization with Applications to Sources with Memory
An algorithm is derived for designing tree structured vector quantizers to encode sources with memory The algorithm minimizes the average distortion subject to a conditional entropy constraint and the tree structure restriction This technique called conditional entropy constrained tree structured vector quantization CECTSVQ can more e ciently exploit the source memory This work is an extension ...
متن کاملEmbedded Entropy-Constrained Trellis Coded Quantization
A new variable-rate embedded quantization technique, called Embedded Entropy-Constrained Trellis Coded Quantization (E-ECTCQ) is developed. Its performance is compared to that of variable-rate embedded scalar quantizers. Simulations indicate that performance depends both upon the number of embedded quantization stages and the number of trellis states.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997